A branch-and-price guided search approach to maritime inventory routing

نویسندگان

  • Mike Hewitt
  • George L. Nemhauser
  • Martin W. P. Savelsbergh
  • Jin-Hwa Song
چکیده

We apply the methodology Branch-and-Price Guided Search to a real-world maritime inventory routing problem. Computational experiments demonstrate that the approach quickly produces solutions that are near-optimal and of better quality than those produced by a state-of-the-art, commercial integer programming solver when given much more time. We also develop local search schemes to further reduce the time needed to find high quality solutions and present computational evidence of their efficacy. Research supported in part by funding from Exxon Mobil Research and Engineering Company. ∗Corresponding author Email address: [email protected] (Mike Hewitt) Jin-Hwa Song is currently with SK Innovation, Seoul, Korea. Preprint submitted to Elsevier December 1, 2011

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem

We consider a single product maritime inventory routing problem in which the production and consumption rates are constant over the planning horizon. The problem involves a heterogeneous fleet of ships and multiple production and consumption ports with limited storage capacity. In spite of being one of the most common ways to transport goods, maritime transportation is characterized by high lev...

متن کامل

An Integrated Inventory-Routing System for Multi-item Joint Replenishment with Limited Vehicle Capacity

In this paper, we develop a mathematical programming approach for coordinating inventory and transportation decisions in an inbound commodity collection system. In particular, we consider a system that consists of a set of geographically dispersed suppliers that manufacture one or more non-identical items, and a central warehouse that stocks these items. The warehouse faces a constant and deter...

متن کامل

A Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem

In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...

متن کامل

A Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains

Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...

متن کامل

Considering Production Planning in the Multi-period Inventory Routing Problem with Transshipment between Retailers

Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2013